Menger's theorem for fuzzy graphs
نویسندگان
چکیده
The concept of the strongest path plays a crucial role in fuzzy graph theory. In classical graph theory, all paths in a graph are strongest, with a strength value of one. In this article, we introduce Menger’s theorem for fuzzy graphs and discuss the concepts of strengthreducing sets and t-connected fuzzy graphs. We also characterize t-connected and t-arc connected fuzzy graphs. 2012 Elsevier Inc. All rights reserved.
منابع مشابه
Menger's Theorem for a Countable Source Set
Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths...
متن کاملA generalization of Menger's Theorem
This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial role inmany areas of flow and network theory. This paper also introduces and characterizes strength reducing sets of nodes and arcs in weighted graphs. © 2011 Elsevier Ltd. All rights reserved.
متن کاملOn 3*-connected graphs
Menger's Theorem states that in a 3-connected graph, any two vertices are joined by three openly disjoint paths. Here we consider 3-connected cubic graphs where two vertices exist so that the three disjoint paths between them contain all of the vertices of the graph (we call these graphs 3*connected); and also where the latter is true for ALL pairs of vertices (globally 3*-connected). A necessa...
متن کاملTopics in Graph Theory
Abstract. This paper is an exposition of some classic results in graph theory and their applications. A proof of Tutte’s theorem is given, which is then used to derive Hall’s marriage theorem for bipartite graphs. Some compelling applications of Hall’s theorem are provided as well. In the final section we present a detailed proof of Menger’s theorem and demonstrate its power by deriving König’s...
متن کاملMenger's theorem for infinite graphs with ends
A well-known conjecture of Erdős states that, given an infinite graph G and sets A,B ⊆ V (G), there exists a family of disjoint A–B paths P together with an A–B separator X consisting of a choice of one vertex from each path in P. There is a natural extension of this conjecture in which A, B and X may contain ends as well as vertices. We prove this extension by reducing it to the vertex version...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 222 شماره
صفحات -
تاریخ انتشار 2013